Machine Comprehension Using Match-LSTM and Answer Pointer
نویسندگان
چکیده
Machine comprehension of text is an important problem in natural language processing. A recently released dataset, the Stanford Question Answering Dataset (SQuAD), offers a large number of real questions and their answers created by humans through crowdsourcing. SQuAD provides a challenging testbed for evaluating machine comprehension algorithms, partly because compared with previous datasets, in SQuAD the answers do not come from a small set of candidate answers and they have variable lengths. We propose an end-to-end neural architecture for the task. The architecture is based on match-LSTM, a model we proposed previously for textual entailment, and Pointer Net, a sequence-to-sequence model proposed by Vinyals et al. (2015) to constrain the output tokens to be from the input sequences. We propose two ways of using Pointer Net for our task. Our experiments show that both of our two models substantially outperform the best results obtained by Rajpurkar et al. (2016) using logistic regression and manually crafted features.
منابع مشابه
Improving Match-LSTM for Machine Comprehension
Machine comprehension is a critical problem that lies on the frontier of natural language processing. The Stanford Question Answering Dataset (SQuAD), offers a set of questions and their answers created by humans through crowdsourcing. We implemented an end-to-end neural architecture for the task based on MatchLSTM and Pointer Net, inspired by previous work done by Wang and Jiang in Machine Com...
متن کاملSing M Atch - Lstm and a Nswer P Ointer
Machine comprehension of text is an important problem in natural language processing. A recently released dataset, the Stanford Question Answering Dataset (SQuAD), offers a large number of real questions and their answers created by humans through crowdsourcing. SQuAD provides a challenging testbed for evaluating machine comprehension algorithms, partly because compared with previous datasets, ...
متن کاملQuestion Answering Using Match-LSTM and Answer Pointer
Machine comprehension of text is a significant problem in natural language processing today – in this project, we tackle machine reading comprehension as applied to question answering. Our goal is: given a question and a context paragraph, to extract from the paragraph the answer to the question. As an oracle, on the dataset we used, humans score over 86.8% accuracy (EM) on the test set for thi...
متن کاملCoattention Answer-Pointer Networks for Question Answering
Machine comprehension (MC) and question answering (QA) are crucial tasks in natural language understanding. Training deep neural network-based QA models has become practical upon the recent release of the Stanford Question Answering Dataset (SQuAD), a significantly larger dataset of question-answer pairs created by humans on a set of Wikipedia articles [1]. In this paper, we propose an end-to-e...
متن کاملQuestion Answering Using Regularized Match-LSTM and Answer Pointer
Automated reading comprehension is an important problem in natural language processing. The Stanford Question Answering Dataset (SQuAD) is a convenient set of questions and crowdsourced answers to utilize for evaluation of QA systems. In this paper, we implement a version of an architecture proposed by Wang and Jiang (2016) based on match-LSTM [9], a model used for textual entailment, and answe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1608.07905 شماره
صفحات -
تاریخ انتشار 2016